The Ant-Lion Paradigm for Strong Normalization
نویسندگان
چکیده
منابع مشابه
The Ant Lion Optimization Algorithm for Flexible Process Planning
Obtaining an optimal process plan according to all alternative manufacturing resources has become very important task in flexible process planning problem research. In this paper, we use a novel nature-inspired algorithm called Ant Lion Optimizer (ALO) to solve this NP-hard combinatorial optimization problem. The network representation is adopted to describe flexibilities in process planning an...
متن کاملOPTIMUM DESIGN OF SKELETAL STRUCTURES USING ANT LION OPTIMIZER
This paper utilizes recent optimization algorithm called Ant Lion Optimizer (ALO) for optimal design of skeletal structures. The ALO is based on the hunting mechanism of Antlions in nature. The random walk of ants, building traps, entrapment of ants in traps, catching preys, and re-building traps are main steps for this algorithm. The new algorithm is examined by designing three truss and frame...
متن کاملIs an ant larger than a lion?
In order to examine the influence exerted by an irrelevant semantic variable in a comparative judgment task, we employed a Stroop-like paradigm. The stimuli were pairs of animal names that were different in their physical and semantic sizes (e.g., ant lion). Participants were asked to judge which of the two words was larger either in physical or in semantic size. Size congruity effect (i.e., fa...
متن کاملContinuous Semantics for Strong Normalization
We prove a general strong normalization theorem for higher type rewrite systems based on Tait’s strong computability predicates and a strictly continuous domain-theoretic semantics. The theorem applies to extensions of Gödel’s system T , but also to various forms of bar recursion for which strong normalization was hitherto unknown.
متن کاملLazy Strong Normalization
Among all the reduction strategies for the untyped λ-calculus, the so called lazy β-evaluation is of particular interest due to its large applicability to functional programming languages (e.g. Haskell [3]). This strategy reduces only redexes not inside a lambda abstraction. The lazy strongly βnormalizing terms are the λ-terms that don’t have infinite lazy β-reduction sequences. This paper pres...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 1994
ISSN: 0890-5401
DOI: 10.1006/inco.1994.1079